Quartet consistency count method for reconstructing phylogenetic trees
نویسندگان
چکیده
Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualitative nature of neighborjoining and that of dissimilarity maps from DNA sequence data. Moreover, the new algorithm always reconstructs correct trees from quartet consistent dissimilarity maps.
منابع مشابه
A Global Maximum Likelihood Super-Quartet Phylogeny Method
Extending the idea of our previous algorithm [17, 18] we developed a new sequential quartet-based phylogenetic tree construction method. This new algorithm reconstructs the phylogenetic tree iteratively by examining at each merge step every possible super-quartet which is formed by four subtrees instead of simple quartet in our previous algorithm. Because our new algorithm evaluates super-quart...
متن کاملThe Short Quartet Method
Reconstructing phylogenetic (evolutionary) trees is a major research problem in biology, but unfortunately the current methods are either inconsistent somewhere in the parameter space (and hence do not reconstruct the tree even given unboundedly long sequences), have poor statistical power (and hence require extremely long sequences on large or highly divergent trees), or have computational req...
متن کاملA Collapsing Method for Efficient Recovery of Optimal Edges in Phylogenetic Trees
In this thesis we present a novel algorithm, HyperCleaning∗ for effectively inferring phylogenetic trees. The method is based on the quartet method paradigm and is guaranteed to recover the best supported edges of the underlying phylogeny based on the witness quartet set. This is performed efficiently using a collapsing mechanism that employs memory/time tradeoff to ensure no loss of informatio...
متن کاملQuartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies
A versatile method, quartet puzzling, is introduced to reconstruct the topology (branching pattern) of a phylogenetic tree based on DNA or amino acid sequence data. This method applies maximum-likelihood tree reconstruction to all possible quartets that can be formed from n sequences. The quartet trees serve as starting points to reconstruct a set of optimal n-taxon trees. The majority rule con...
متن کاملReconstructing a level-1-network from quartets
This paper deals with the problem of reconstructing a phylogenetic network from quartets. Specifically a polynomial-time algorithm was implemented to reconstruct trees and level1-networks from quartet data that satisfies certain conditions. This algorithm uses linear algebra methods to construct the set of orders the taxa can have along the boundary when drawing a planar embedding of the networ...
متن کامل